Co-Allocation with Collective Requests in Grid Systems

نویسندگان

  • Matija Cankar
  • Matej Artac
  • Marjan Sterk
  • Uros Lotric
  • Bostjan Slivnik
چکیده

We present a new algorithm for resource allocation in large, heterogeneous grids. Its main advantage over existing co-allocation algorithms is that it supports collective requests with partial resource reservation, where the focus is on better grid utilisation. Alongside the requests that must be fulfilled by each resource, a collective request specifies the total amount of a required resource property without a strict assumption with regard to its distribution. As a consequence, the job becomes much more flexible in terms of its resource assignment and the co-allocation algorithm may therefore start the job earlier. This flexibility increases grid utilisation as it allows an optimisation of job placement that leads to a greater number of accepted jobs. The proposed algorithm is implemented as a module in the XtreemOS grid operating system. Its performance and complexity have been assessed through experiments on the Grid’5000 infrastructure. The results reveal that in most cases the algorithm returns optimal start times for jobs and acceptable, but sometimes suboptimal resource sets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Specifying and Processing Co-Reservations in the Grid

Executing complex applications on Grid infrastructures necessitates the guaranteed allocation of multiple resources. Such guarantees are often implemented by means of advance reservations. Reserving resources in advance requires multiple steps – beginning with their description to their actual allocation. In a Grid, a client possesses little knowledge about the future status of resources. Thus,...

متن کامل

Elastic Grid Reservations with User-Defined Optimization Policies

We present an algorithm for reserving compute resources in a Grid, that allows users to define an optimization strategy, if multiple candidates match the specified requirements. Reservations need not to be exact, but can be elastic in some properties like start-, end-time, duration or the number of requested CPUs. Our algorithm takes the speedup of applications into account to accordingly adjus...

متن کامل

Co-scheduling Deadline-Sensitive Applications in Large-scale Grid Systems

In large-scale grid systems, plenty of applications are constrained by soft or hard deadline requirement. However, it is difficult to guarantee the deadline requirements of these applications because of the dynamical nature of distributed systems. In this paper, a novel approach is proposed to evaluate the deadline-guarantee of co-allocation schemes that obtained from conventional co-allocation...

متن کامل

Co-allocation in Data Grids: A Global, Multi-user Perspective

Several recent studies suggest that co-allocation techniques can improve user performance for distributed data retrieval in replicated grid systems. These studies demonstrate that co-allocation techniques can improve network bandwidth and network transfer times by concurrently utilizing as many data grid replicas as possible. However, these prior studies evaluate their techniques from a single ...

متن کامل

A New Algorithm for Scheduling Parallel Tasks in Utility Grids using Reserve Resources for Tasks with Deadline

In recent years, Grid computing systems have emerged as a solution to achieve distributed systems. Grid System is a collection of computing resources and users that are scattered around the world. These systems are developing and becoming more widespread with ever-increasing speed. Development of Grids and increase of the number of available resources and also increase in the number of users’ r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. UCS

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2013